Capacitated location routing problem with simultaneous pickup and delivery under the risk of disruption

This paper develops a new mathematical model to study location-routing problem with simultaneous pickup and delivery under the risk of disruption. A remarkable number previous studies have assumed that network components ( e.g. , routes, production factories, depots, etc.) are always available can permanently serve customers. assumption is no longer valid when faces disruptions such as flood, earthquake, tsunami, terrorist attacks workers strike. In case any disruption in network, tremendous cost imposed on stockholders. Incorporating design phase will alleviate impact these disasters let resist this study, mixed integer programming (MIP) proposed formulates reliable capacitated (RCLRP-SPD) services supply chain distribution network. The objective function attempts minimize sum location routing vehicles unfulfilled demand Since NP-Hard, three meta-heuristics tailored for large-sized instances results show outperformance hybrid algorithms comparing classic genetic algorithm. Finally, obtained discussed concluded.